A Simulated Annealing Approach to Reporting Cell Planning Problem of Mobile Location Management
نویسندگان
چکیده
In this paper, Reporting Cell Planning Problem of Location Management in mobile computing system is addressed. In reporting cell planning, some cells in the network are designated as reporting cells and other cells are non-reporting cells. Mobile terminals update information about its current location in a database when it enters into a new reporting cell. The goal of the reporting cell planning problem is to select subset of cells in the network as reporting cells such that the total location management cost is minimized. The selection of a set of reporting cells is a combinatorial optimization problem. In this paper, a new approach based on simulated annealing meta-heuristic is presented to obtain near to optimal solution for the reporting cell planning problem. Keywords—Simulated Annealing, Reporiting Cell Planning, Location Management, Mobile Computing
منابع مشابه
A Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)
Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کاملEfficient location area planning for cellular networks with hierarchical location databases
Location area planning (LAP) is an important issue in the design of high-performance PCS networks. It could have a serious impact on the total mobility management cost of mobile terminals. Most of the previous works either explored the LAP problem as a 0–1 linear programming problem or used adopted techniques, such as simulated annealing, taboo search, and genetic algorithms [IEEE Trans. Vehicu...
متن کاملحل ابتکاری و کران پایین برای مسئله مکانیابی-مسیریابی دو ردهای
During the last three decades, the integrated optimization approach to logistics systems has become one of the most important aspects of the supply chain optimization. This approach simultaneously considers the interdependence of the location of the facilities, suppliers/customers allocation to the facilities, the structure of transportation routes, and inventory planning and control. Location...
متن کاملA Multi-level Capacitated Lot-sizing Problem with Safety Stock Deficit and Production Manners: A Revised Simulated Annealing
[1] Corresponding author e-mail: [email protected] [1] Corresponding author e-mail: [email protected] Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level ca...
متن کامل